Efficient metacomputing of elliptic linear and non-linear problems

نویسندگان

  • Nicolas Barberou
  • Marc Garbey
  • Matthias Hess
  • Michael M. Resch
  • Tuomo Rossi
  • Jari Toivanen
  • Damien Tromeur-Dervout
چکیده

Metacomputing is a method of using the GRID, which originated in the US and quickly was also picked up by European and Japanese researchers where a number of challenging projects were aiming at the exploitation of such distributed resources. Especially the GLOBUS project (The globus project: a status report, Proceedings IPPS/SPDP’98 Heterogeneous Computing Workshop, 1998, pp. 4–18) has contributed to the success of metacomputing substantially. However, high latency and low bandwidth have made people doubt the feasibility of this concept for big simulation codes. In this paper we present new numerical methods that help to exploit such configurations and overcome the problems of low network performance. To proof the feasibility of our approach we show results of simulations in an innovative GRID environment of supercomputers. r 2003 Elsevier Science (USA). All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New variants of the global Krylov type methods for linear systems with multiple right-hand sides arising in elliptic PDEs

In this paper, we present new variants of global bi-conjugate gradient (Gl-BiCG) and global bi-conjugate residual (Gl-BiCR) methods for solving nonsymmetric linear systems with multiple right-hand sides. These methods are based on global oblique projections of the initial residual onto a matrix Krylov subspace. It is shown that these new algorithms converge faster and more smoothly than the Gl-...

متن کامل

Renormalized Solutions for Strongly Nonlinear Elliptic Problems with Lower Order Terms and Measure Data in Orlicz-Sobolev Spaces

The purpose of this paper is to prove the existence of a renormalized solution of perturbed elliptic problems$ -operatorname{div}Big(a(x,u,nabla u)+Phi(u) Big)+ g(x,u,nabla u) = mumbox{ in }Omega,  $ in the framework of Orlicz-Sobolev spaces without any restriction on the $M$ N-function of the Orlicz spaces, where $-operatorname{div}Big(a(x,u,nabla u)Big)$ is a Leray-Lions operator defined f...

متن کامل

Presentation and Solving Non-Linear Quad-Level Programming Problem Utilizing a Heuristic Approach Based on Taylor Theorem

The multi-level programming problems are attractive for many researchers because of their application in several areas such as economic, traffic, finance, management, transportation, information technology, engineering and so on. It has been proven that even the general bi-level programming problem is an NP-hard problem, so the multi-level problems are practical and complicated problems therefo...

متن کامل

Comparative Study of Particle Swarm Optimization and Genetic Algorithm Applied for Noisy Non-Linear Optimization Problems

Optimization of noisy non-linear problems plays a key role in engineering and design problems. These optimization problems can't be solved effectively by using conventional optimization methods. However, metaheuristic algorithms such as Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) seem very efficient to approach in these problems and became very popular. The efficiency of these ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Parallel Distrib. Comput.

دوره 63  شماره 

صفحات  -

تاریخ انتشار 2003